The New Formal Method Calculus for Cryptographic Protocols
نویسنده
چکیده
Hasan M. Al-Refai [email protected] [email protected] Mobile Phone #: 00962-777357755 Abstract The history of the application of formal methods to cryptographic protocols analysis spans over twenty years. Recently has been showing signs of new maturity and consolidation. This paper will introduce a new variant of the spi-calculus which introduced by M.Abadi and A.Gordan. By using this revised spi-calculus, which called spi-H-calculus, we will illustrate and prove that our calculi is decidable for main security properties: Authenticity and Secrecy than M.Abadi and A.Gordan .
منابع مشابه
On formal and automatic security verification of WSN transport protocols
In this paper, we address the problem of formal and automated security verification ofWSN transport protocols that may perform cryptographic operations. The verification ofthis class of protocols is difficult because they typically consist of complex behavioral charac-teristics, such as real-time, probabilistic, and cryptographic operations. To solve this problem,we propose a pr...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملApplying Spi - calculus for PayWord *
Achieving strong security properties is a core part of wide acceptance of electronic commerce, hence it is essential to provide detailed security analysis for cryptographic protocols. There are protocols considered secure for a long time, still it is shown they contain flaws. Therefore it has been recognized that informal arguments about protocol correctness are not reliable. Formal methods off...
متن کاملFramework for reasoning about cryptographic protocols with randomization
Context. Cryptographic protocols are distributed programs which use cryptographic primitives to secure communication over untrusted networks (such as the Internet). They are designed to achieve security properties such as confidentiality, authentication or anonymity. Due to the complexity of cryptographic primitives, the inherent concurrency and the untrusted nature of networks, their design ha...
متن کاملImplementing Spi Calculus Using Nominal Techniques
The aim of this work is to obtain an interactive proof environment based on Isabelle/HOL for reasoning formally about cryptographic protocols, expressed as processes of the spi calculus (a π-calculus with cryptographic primitives). To this end, we formalise syntax, semantics, and hedged bisimulation, an environment-sensitive bisimulation which can be used for proving security properties of prot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012